A reciprocity approach to computing generating functions for permutations with no pattern matches
نویسنده
چکیده
2011 Using the reciprocal to calculate generating functions for permutations with no consecutive pattern matches Permutation Patterns 2011 San Luis Obispo, CA 2011 Reciprocal method to enumerate permutations with no consecutive pattern matches FPSAC 2011 Reykjavik, Iceland 2010 Pattern matching in the cycle structure of permutations Permutation Patterns 2010 Dartmouth, NH 2010 Advancement to candidacy UCSD
منابع مشابه
Permutations and words counted by consecutive patterns
Generating functions which count occurrences of consecutive sequences in a permutation or a word which matches a given pattern are studied by exploiting the combinatorics associated with symmetric functions. Our theorems take the generating function for the number of permutations which do not contain a certain pattern and give generating functions refining permutations by the both the total num...
متن کاملProbability Generating Functions for Sattolo’s Algorithm
In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. Recently, H. Prodinger analysed two important random variables associated with the algorithm, and found their mean and variance. H. Mahmoud extended Prodinger’s analysis by finding limit laws for the same two random variables.The present article, starting from the ...
متن کاملGenerating functions for descents over permutations which avoid sets of consecutive patterns
We extend the reciprocity method of Jones and Remmel ([Discrete Math. 313 (2013), 2712–2729] and [Pure Math. Appl. 24 (2013), 151–178]) to study generating functions of the form ∑ n≥0 t n! ∑ σ∈NMn(Γ) xy where Γ is a set of permutations which start with 1 and have at most one descent, NMn(Γ) is the set of permutations σ in the symmetric group Sn which have no Γ-matches, des(σ) is the number of d...
متن کاملNew pattern matching conditions for wreath products of the cyclic groups with symmetric groups
We present several multi-variable generating functions for a new pattern matching condition on the wreath product Ck o Sn of the cyclic group Ck and the symmetric group Sn. Our new pattern matching condition requires that the underlying permutations match in the usual sense of pattern matching for Sn and that the corresponding sequence of signs match in the sense of words, rather than the exact...
متن کاملConsecutive Up-down Patterns in Up-down Permutations
In this paper, we study the distribution of the number of consecutive pattern matches of the five up-down permutations of length four, 1324, 2314, 2413, 1432, and 3412, in the set of up-down permutations. We show that for any such τ , the generating function for the distribution of the number of consecutive pattern matches of τ in the set of up-down permutations can be expressed in terms of wha...
متن کامل